Improved Tight Performance Bounds on Concatenated Codes
ثبت نشده
چکیده
منابع مشابه
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
The ensemble performance of parallel and serial concatenated turbo codes is considered, where the ensemble is generated by a uniform choice of the interleaver and of the component codes taken from the set of time varying recursive systematic convolutional codes. Following the derivation of the input-output weight enumeration functions of the ensembles of random parallel and serial concatenated ...
متن کاملWoven codes with outer warp: variations, design, and distance properties
In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...
متن کاملAnalysis and Design of Concatenated Codes
A new general concatenated code structure, containing both parallel and serially concatenated codes as special cases, is presented. The structure provides a unified framework for the analysis of concatenated codes and offers new degrees of freedom for code design. Performance analysis based on bounds on the error probability in the error floor region and suggestions for suitable design criteria...
متن کاملCoding and Iterative Decoding of Concentrated Multi-level Codes for the Rayleigh Fading Channel
In this thesis we present the concept of concatenated multilevel codes. These codes are a combination of generalized concatenated codes with multilevel coding. The structure of these codes is simple and relies on the concatenation of two or more codes of shorter length. These codes can be designed to have large diversity which makes them attractive for use in fading channels. We also present an...
متن کاملPerformance of parallel and serial concatenated codes on fading channels
The performance of parallel and serial concatenated codes on frequency-nonselective fading channels is considered. The analytical average upper bounds of the code performance over the Rician channels with independent fading are derived. Furthermore, the log-likelihood ratios and extrinsic information for maximum a posteriori (MAP) probability and soft-output Viterbi algorithm (SOVA) decoding me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999